schedule n. 1.目錄。 2.表(格);清單,明細表。 3.〔美國〕程序表,計劃表;進度表;時間表。 4. 〔美國〕預定日期,預定計劃。 a schedule of prices 定價表。 a train schedule 火車時刻表。 a design schedule 設計計算表,進度表。 according to schedule 按照預定計劃[時間表]。 behind [ahead of] schedule (time) 比預定時間晚[早]。 file [give in] one's schedule (宣布)破產。 on schedule (time) 1. 按時間表,準時。 2. 按照預定計劃。 vt. 1. 為…作目錄。 2.將…列表,把…記入表格。 3.將…列入程序表[計劃表,進度表];為…規(guī)定時間表[進度計劃]。 4.排定,安排。 Supper is scheduled for six o'clock. 晚餐預定六時開始。 be scheduled to (sail today) 預定(本日開船)。 scheduled time (火車等的)時刻表,預定時間。
Associating sequential and concurrent schedules , by administering chemotherapy before or after concurrent chemoradiation , has been re - cently investigated , but the best sequence remains a matter of controversy 最近有人研究在放化療并用之前或之后用續(xù)貫化療和并行化療,但是最好的次序仍在爭論中。
Based on the analysis on the concurrent processing performance requirements of monitoring system , a priority queuing algorithm is proposed to realize the concurrent scheduling of vehicle monitoring system with the algorithm implementation scheme given 在對監(jiān)控中心并發(fā)處理的性能要求進行分析的基礎上,提出了優(yōu)先數(shù)事件隊列算法來實現(xiàn)車輛監(jiān)控中心的并發(fā)調度機制,并給出了算法實現(xiàn)。
To verify the feasibility of the architecture and investigate its applicability , according to the three basic concepts for holonic manufacturing control : " hierarchy in distributed systems " , " distribution of decision power " and " concurrent scheduling and schedule execution " , this dissertation presents a holonic manufacturing control architecture and an interaction mechanism that combine the best of hierarchical and heterarchical control 為了驗證hms - ra體系結構的可應用性,本文進一步基于“分布式系統(tǒng)中的遞階結構” 、 “分布式決策能力”和“并行的調度與調度執(zhí)行”這三個有關合弄制造控制的基本概念,深入研究了合弄制造的控制結構和制造合弄間的交互機制,以便將遞階制造控制和分布式制造控制的優(yōu)點結合起來。
We analysis the conflict , convert channel and starvation problems of concurrent schedule based on strict - 2pl locking protocal which applies nhstm model , then present a concurrent scheduling algorithm making use of buffer and point p . also , we proved the concurrent schedule algorithm is serializable . at the same time , we introduce the key technical used in nhsdb concurrency control mechanism , and give the implementation details 我們對應用nhstm模型的,通過應用嚴格兩段鎖協(xié)議實施的并發(fā)調度中,可能存在的并發(fā)沖突,隱通道和饑餓問題進行分析,在此基礎上提出了一種利用緩沖和p點的并發(fā)調度算法,并給出了該算法的并發(fā)調度正確性證明,解決多級安全條件下的隱通道和饑餓問題。